Some applications of pq-groups in graph theory
نویسندگان
چکیده
منابع مشابه
Some applications of pq-groups in graph theory
We describe some new applications of nonabelian pq-groups to construction problems in Graph Theory. The constructions include the smallest known trivalent graph of girth 17, the smallest known regular graphs of girth five for several degrees, along with four edge colorings of complete graphs that improve lower bounds on classical Ramsey numbers.
متن کاملOn some applications of graph theory, I
In a series of papers, of which the present one is Part I, it is shown that solutions to a variety of problems in distance geoinetry, potential theory and theory of metric spaces arc provided by appropriate applications of graph theoretic results. §1 In what follows we are going to discuss systematic applications of graph theory-among others-to geometry, to potential theory, and to the theory o...
متن کاملOn Some Applications of Graph Theory Iii
1 . In the first and second parts of this sequence we dealt with applications of graph theory to distance distribution in certain sets in euclidean spaces, to potential theory, to estimations of the transfinite diameter [1] and to value distribution of "triangle functionals" (e.g. perimeter, area of triangles) [2] . The basic tool is provided in all these applications by the result formulated a...
متن کاملOn Some Applications of Graph Theory, II
For m = 2 we get the graphs. n is again the order of the m-graph; the meaning of m-subgraphs, complete m-graphs is obvious. We shall deal especially with the case m = 3, i.e. with the case of trigraphs, though the geometrical problems we are dealing with have natural analogues (and also problems of new type) for higher dimensions, and these involve m-graphs with general m’s, Let A,, A,, A, be t...
متن کاملSome Applications of Graph Theory to Numbers Theory
Let al <. .. < ak s n be a sequence of integers no one of which divides any other. It 1s not difficult to see that max k-[Et'-) [1]. Assume now that no a i divides the product of two others, then I proved that [2] (r(x) denotes the number of primes c x2/3 (1) n (x) +-l Z < max k (t .9 =) not exceeding x) x 2/3 < e(x) + c 2 (tog =) 2 The proof of both the upper and the lower bound used combinato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2004
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1217